Davis-Putnam Style Rules for Deciding Property S
نویسندگان
چکیده
Two set systems E , F on an underlying set V will be said to have Property S if there exists a subset σ of V , such that σ ∩ e 6= ∅, for all e ∈ E and f 6⊆ σ, for all f ∈ F (see [8], [9]]). We give rules for deciding Property S, which generalizes the very successful Davis-Putnam rules for deciding satisfiability in propositional logic.
منابع مشابه
3-Coloring in Time O(1.3289^n)
We consider worst case time bounds for NP-complete problems including 3-SAT, 3-coloring, 3-edge-coloring, and 3-list-coloring. Our algorithms are based on a constraint satisfaction (CSP) formulation of these problems. 3-SAT is equivalent to (2, 3)-CSP while the other problems above are special cases of (3, 2)-CSP; there is also a natural duality transformation from (a, b)-CSP to (b, a)-CSP. We ...
متن کاملOn the Limit of Branching Rules for Hard Random Unsatisfiable 3-SAT
We study the limit of branching rules in Davis-Putnam (DP) procedure for hard random unsatisfiable 3-SAT and try to answer the question: what would be the search tree size if every branching variable were the best possible? The issue is of practical interest because many efforts have been spent for designing better branching rules. Our experimental results suggest that the branching rules used ...
متن کاملConflict-based Selection of Branching Rules in SAT-Algorithms
The problem of proving that a propositional boolean formula is satisfiable (SAT) is one of the fundamental problems in computer science. The application of SAT solvers in VLSI CAD has become of major interest. The most popular SAT algorithms are based on the well known Davis-Putnam procedure. There, to guide the search, a branching rule is applied for selecting and assigning unassigned variable...
متن کاملImproving Propositional Satisfiability Algorithms by Dynamic Selection of Branching Rules
The problem of proving that a propositional boolean formula is satisfiable (SAT) is one of the fundamental problems in computer science. The most popular SAT algorithms are based on the well known Davis-Putnam procedure. There, to guide search, a branching rule is applied for selecting still unassigned variables and computing an assignment to this variable. Additionally, conflict analysis metho...
متن کاملComputing Stable Models by Program Transformation
In analogy to the Davis-Putnam procedure we develop a new procedure for computing stable models of propositional normal disjunctive logic programs, using case analysis and simplification. Our procedure enumerates all stable models without repetition and without the need for a minimality check. Since it is not necessary to store the set of stable models explicitly, the procedure runs in polynomi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Fundam. Inform.
دوره 79 شماره
صفحات -
تاریخ انتشار 2007